Accurate Large-Scale Bearing-Only SLAM by Map Joining

نویسندگان

  • Adizul Ahmad
  • Shoudong Huang
  • Gamini Dissanayake
چکیده

This paper presents a bearing-only SLAM algorithm that generates accurate and consistent maps of large environments by joining a series of small local maps. The local maps are built by least squares optimization with a proper landmark initialization technique. The local maps are then combined to build global map using Iterated Sparse Local Submap Joining Filter (ISLSJF). The accuracy and consistency of the proposed algorithm is evaluated using simulation data sets. The algorithm is also tested using the DLR-Spatial-Cognition data set and the preprocessed Victoria Park data where the range information is ignored. The global map results are very similar to the result of full least squares optimization starting with very accurate initial values. As I-SLSJF is able to join a given set of local maps and associated uncertainties efficiently without any information loss, these results demonstrate that focusing on generating accurate local maps is a promising direction for solving large-scale bearing-only SLAM problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Adaptive UKF Algorithm to Improve the Accuracy of SLAM

SLAM (Simultaneous Localization and Mapping) is a fundamental problem when an autonomous mobile robot explores an unknown environment by constructing/updating the environment map and localizing itself in this built map. The all-important problem of SLAM is revisited in this paper and a solution based on Adaptive Unscented Kalman Filter (AUKF) is presented. We will explain the detailed algorithm...

متن کامل

Efficient Large Scale SLAM Including Data Association using the Combined Filter

In this paper we describe the Combined Filter, a judicious combination of Extended Kalman (EKF) and Extended Information filters (EIF) that can be used to execute highly efficient SLAM in large environments. With the CF, filter updates can be executed in as low as O(logn) as compared with other EKF and EIF based algorithms: O(n2) for Map Joining SLAM, O(n) for Divide and Conquer (D&C) SLAM, and...

متن کامل

Robocentric map joining: Improving the consistency of EKF-SLAM

In this paper1 we study the Extended Kalman Filter approach to simultaneous localization and mapping (EKF-SLAM), describing its known properties and limitations, and concentrate on the filter consistency issue. We show that linearization of the inherent nonlinearities of both the vehicle motion and the sensor models frequently drives the solution of the EKF-SLAM out of consistency, specially in...

متن کامل

A Single-Step Maximum A Posteriori Update for Bearing-Only SLAM

This paper presents a novel recursive maximum a posteriori update for the Kalman formulation of undelayed bearing-only SLAM. The estimation update step is cast as an optimization problem for which we can prove the global minimum is reachable via a bidirectional search using Gauss-Newton’s method along a one-dimensional manifold. While the filter is designed for mapping just one landmark, it is ...

متن کامل

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010